Self-Approaching Curves
نویسندگان
چکیده
We present a new class of curves which are self-approaching in the following sense. For any three consecutive points a, b, c on the curve the point b is closer to c than a to c. This is a generalisation of curves with increasing chords which are self-approaching in both directions. We show a tight upper bound of 5.3331 . . . for the length of a self-approaching curve over the distance between its endpoints.
منابع مشابه
Self-Approaching Paths in Simple Polygons
We study self-approaching paths that are contained in a simple polygon. A self-approaching path is a directed curve connecting two points such that the Euclidean distance between a point moving along the path and any future position does not increase, that is, for all points a, b, and c that appear in that order along the curve, |ac| ≥ |bc|. We analyze the properties, and present a characteriza...
متن کاملAn Optimal G^2-Hermite Interpolation by Rational Cubic Bézier Curves
In this paper, we study a geometric G^2 Hermite interpolation by planar rational cubic Bézier curves. Two data points, two tangent vectors and two signed curvatures interpolated per each rational segment. We give the necessary and the sufficient intrinsic geometric conditions for two C^2 parametric curves to be connected with G2 continuity. Locally, the free parameters w...
متن کاملThe Approaching Algorithm of Outline Curves Based on Messy Data
The variance of the spatial topological relationships and how to restore these relationships by the geometric relationships between points are researched. A kind of approaching algorithm of outline curves based on messy data is presented. The test results in virtual navigating environment are also given.
متن کاملGeneralized Self-Approaching Curves
We consider all planar oriented curves that have the following property depending on a xed angle '. For each point B on the curve, the rest of the curve lies inside a wedge of angle ' with apex in B. This property restrains the curve's meandering, and for ' 2 this means that a point running along the curve always gets closer to all points on the remaining part. For all ' < , we provide an upper...
متن کاملMidcourse Trajectory Shaping for Air and Ballistic Defence Guidance Using Bezier Curves
A near-optimal midcourse trajectory shaping guidance algorithm is proposed for both air and ballistic target engagement mission attributes for generic long range interceptor missile. This guidance methodology is based on the maximum final velocity as the objective function and maximum permissible flight altitude as the in-flight state constraint as well as the head-on orientation as the termina...
متن کامل